Flexible job-shop scheduling based on genetic algorithm and simulation validation
نویسندگان
چکیده
منابع مشابه
Multi-objective Scheduling Simulation of Flexible Job-shop Based on Multi-population Genetic Algorithm
In view of the difficulty of obtaining the optimal solution to the multi-objective scheduling of flexible job-shop by the general genetic algorithm, this paper takes into account the shortest processing time and the balanced use of machines, and puts forward the multi-population genetic algorithm based on the multi-objective scheduling of flexible job-shop. The method attempts to minimize the l...
متن کاملA Genetic Algorithm for Flexible Job-Shop Scheduling
— Flexible Job Shop scheduling problem (FJSSP) is an important scheduling problem which has received considerable importance in the manufacturing domain. In this paper a genetic algorithm (GA) based scheduler is presented for flexible job shop problem to minimise makespan. The proposed approach implements a domain independent GA to solve this important class of problem. The scheduler is impleme...
متن کاملSolving the Dynamic Job Shop Scheduling Problem using Bottleneck and Intelligent Agents based on Genetic Algorithm
The problem of Dynamic Job Shop (DJS) scheduling is one of the most complex problems of machine scheduling. This problem is one of NP-Hard problems for solving which numerous heuristic and metaheuristic methods have so far been presented. Genetic Algorithms (GA) are one of these methods which are successfully applied to these problems. In these approaches, of course, better quality of solutions...
متن کاملGenetic algorithm for the flexible job-shop scheduling problem
In this paper, we propose a new optimization technique, the hierarchical multi-space competitive distributed genetic algorithm (HmcDGA), which is effective for the hierarchical optimization problem. It is an extension of the multi-space competitive distributed genetic algorithm (mcDGA), which was proposed by the authors. The mcDGA efficiently finds an optimal solution with a low computational c...
متن کاملOptimality of the flexible job shop scheduling system based on Gravitational Search Algorithm
The Flexible Job Shop Scheduling Problem (FJSP) is one of the most general and difficult of all traditional scheduling problems. The Flexible Job Shop Problem (FJSP) is an extension of the classical job shop scheduling problem which allows an operation to be processed by any machine from a given set. The problem is to assign each operation to a machine and to order the operations on the machine...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: MATEC Web of Conferences
سال: 2017
ISSN: 2261-236X
DOI: 10.1051/matecconf/201710002047